A-Scrambling Exists!

نویسنده

  • Martha McGinnis
چکیده

The nature of scrambling is a focus of recent debate in the syntactic literature. The term scrambling is used to describe apparently optional permutations of word order, found especially in languages with extensive case-marking. Saito (1989) argues that scrambling is A-bar movement (like wh-movement), rather than A-movement (like movement to the subject position). Webelhuth (1989) argues for scrambling to positions with mixed Aand A-bar properties, while Mahajan (1990) counters that local (clause-internal) scrambling can be either to an Aor an A-bar position, while long-distance scrambling is A-bar movement. In a recently published paper, Frank, Lee & Rambow (FLR; 1996) take a careful look at different types of evidence for the kind of movement involved in scrambling in German and Korean. They conclude that there is no A-scrambling, and that scrambling is actually a special kind of A-bar movement that can affect binding relations in some languages. However, there is good reason to reconsider the evidence against A-scrambling, and to maintain the strong hypothesis that there are only (at most) three types of syntactic movement—A-, A-bar, and head movement. The central argument to be presented here is based on examples like the Georgian ones below. Suppose that local scrambling can be A-movement, as Mahajan (1990) suggests. Like other types of A-movement, local scrambling can create new binding relations. Thus, although the unscrambled object in (1a) cannot bind a possessive anaphor embedded in the subject, the scrambled object in (1b) can. On the other hand, some binding relations cannot be created by scrambling. For example, the subject anaphor in (2) cannot be bound by either an unscrambled object (2a) or a scrambled one (2b).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asynchronous Implementation of Distributed Coordination Algorithms: Conditions Using Partially Scrambling and Essentially Cyclic Matrices

Given a distributed coordination algorithm (DCA) for agents coupled by a network, which can be characterized by a stochastic matrix, we say that the DCA can be asynchronously implemented if the consensus property is preserved when the agents are activated to update their states according to their own clocks. This paper focuses on two central problems in asynchronous implementation of DCA: which...

متن کامل

Multinuclear Variable Temperature NMR Studies on Cyanide, Water and Hydroxyl Group Scrambling on Halogenation of K2[Pt(CN)4] and Related Reactions

195Pt and 1H NMR has been used to show that addition of chlorine and bromine to [Pt(CN)4]2_ in presence of perchloric acid in water results in cyanide and water scrambling with formation of eleven complexes of the type [Pt(CN)4-nCl(H2O)n+1](n-1)+ (n=0, 1, 2, 3, 4). Addition of NBu4OH ...

متن کامل

Cipher text only attack on speech time scrambling systems using correction of audio spectrogram

Recently permutation multimedia ciphers were broken in a chosen-plaintext scenario. That attack models a very resourceful adversary which may not always be the case. To show insecurity of these ciphers, we present a cipher-text only attack on speech permutation ciphers. We show inherent redundancies of speech can pave the path for a successful cipher-text only attack. To that end, regularities ...

متن کامل

Contribution of Non-scrambled Chroma Information in Privacy-Protected Face Images to Privacy Leakage

To mitigate privacy concerns, scrambling can be used to conceal face regions present in surveillance video content. Given that lightweight scrambling tools may not protect chroma information in order to limit bit rate overhead in heterogeneous usage environments, this paper investigates how the presence of non-scrambled chroma information in face regions influences the effectiveness of automati...

متن کامل

AN2254, Scrambling Code Generation for WCDMA on the StarCore SC140/SC1400 Cores

1 Pseudo-Random Sequences ....................................2 1.1 Randomness Properties ........................................... 2 1.2 Generating Pseudo-Random Sequences ..................2 2 Scrambling Codes for WCDMA .............................2 2.1 Generating Long Complex Scrambling Codes ....... 3 2.2 Scrambling an I-Q/Code Multiplexed Sign ......... al 6 3 Software Implementation on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000